<HTML><HEAD><TITLE>possible_path(+SourceNode, +SinkNode, +Tolerance, +Lengths, +Predecessors, -Path)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>possible_path(+SourceNode, +SinkNode, +Tolerance, +Lengths, +Predecessors, -Path)</H1>
Computes an actual path from a predecessors array
<DL>
<DT><EM>SourceNode</EM></DT>
<DD>source node number
</DD>
<DT><EM>SinkNode</EM></DT>
<DD>sink node number
</DD>
<DT><EM>Tolerance</EM></DT>
<DD>tolerable deviation from minimal length (non-negative number)
</DD>
<DT><EM>Lengths</EM></DT>
<DD>array of numbers
</DD>
<DT><EM>Predecessors</EM></DT>
<DD>array of edge lists
</DD>
<DT><EM>Path</EM></DT>
<DD>Length-EdgeList structure
</DD>
</DL>
<H2>Description</H2>
<P>
    This predicate is deprecated, it is equivalent to possible_path/7 with
    a DistanceArg of 0.
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>possible_path(+, +, +, +, +, -) is nondet
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/possible_path-7.html">possible_path / 7</A>
</BODY></HTML>
